Dynamic lot size problems with one-way product substitution
نویسندگان
چکیده
منابع مشابه
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup and substitution costs, the problem is to find a minimum cost production and substitution plan. This problem generalizes thewell-known uncapacitated lot-sizing problem.We study t...
متن کاملThe Linear Dynamic Lot Size Problem with Minimum Order Quantities
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal ...
متن کاملCombination of Genetic Algorithm With Lagrange Multipliers For Lot-Size Determination in Capacity Constrained Multi-Period, Multi-Product and Multi-Stage Problems
Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...
متن کاملForecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand
We present structural and computational investigations of a new class of weak forecast horizons – minimal forecast horizons under the assumption that future demands are integer multiples of a given positive real number – for a specific class of dynamic lot-size (DLS) problems. Apart from being appropriate in most practical instances, the discreteness assumption offers a significant reduction in...
متن کاملThe Size of One-Way Cellular Automata
We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2005
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170590899607